Combinatorial Bounds on Authentication Codes with Arbitration
نویسندگان
چکیده
Unconditionally secure authentication codes with arbitration (A 2-codes) protect against deceptions from the transmitter and the receiver as well as that from the opponent. In this paper, we present combinatorial lower bounds on the cheating probabilities and the sizes of keys of A 2-codes. Especially, our bounds for A 2-codes without secrecy are all tight for small size of source states.
منابع مشابه
Combinatorial Bounds for Authentication Codes with Arbitration
Unconditionally secure authentication codes with arbitration (A 2 -codes) protect against deceptions from the transmitter and the receiver as well as that from the opponent. In this paper, we present combinatorial lower bounds on the cheating probabilities for A 2 -codes in terms of the number of source states, that of the whole messages and that of messages which the receiver accepts as authen...
متن کاملCombinatorial Classiication of Optimal Authentication Codes with Arbitration Satoshi Obana and Kaoru Kurosawa
Unconditionally secure authentication codes with arbitration (A 2-codes) protect against deceptions from the transmitter and the receiver as well as that from the opponent. We rst show that an optimal A 2-code implies an orthogonal array and an aane-resolvable design. Next we deene a new design, an aane-resolvable + BIBD, and prove that optimal A 2-codes are equivalent to this new design. From ...
متن کاملBounds of Authentication Codeswith
Unconditionally secure authentication codes with arbitration (A 2-codes) protect against deceptions from the transmitter and the receiver as well as that from the opponent. In this paper, we present combinatorial lower bounds on the cheating probabilities and the sizes of keys of A 2-codes. Especially, our bounds for A 2-codes without secrecy are all tight for small size of source states. Our m...
متن کاملLower Bound on the Size of Keys in Authentication Codes with Arbitration*
For the authentication codes with arbitration, Johansson showed lower bounds on the size of keys, but those bounds are no tighter if the size of source states is large. In the present paper , we first present some new lower bounds on the sizes of keys. Next, we discuss the case for large sizes of source states, and then we show that those bounds are tighter. Key-Words: Authentication, codes, ar...
متن کاملGOB designs for authentication codes with arbitration
Combinatorial characterization of optimal authentication codes with arbitration was previously given by several groups of researchers in terms of affine a-resolvable $+$ BIBDs and $\alpha$-resolvable designs with some special properties, respectively. In this paper, we revisit this known characterization and restate it using a new idea of GOB designs. This newly introduced combinatorial structu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Des. Codes Cryptography
دوره 22 شماره
صفحات -
تاریخ انتشار 2001